Simheuristic and learnheuristic algorithms for the temporary-facility location and queuing problem during population treatment or testing events

Epidemic outbreaks, such as the one generated by the coronavirus disease, have raised the need for more efficient healthcare logistics. One of the challenges that many governments have to face in such scenarios is the deployment of temporary medical facilities across a region with the purpose of providing medical services to their citizens. This work tackles this temporary-facility location and queuing problem with the goals of minimizing costs, the expected completion time, population travel and waiting times. The completion time for a facility depends on the numbers assigned to those facilities as well as stochastic arrival times. This work proposes a learnheuristic algorithm to solve the facility location and population assignment problem. Firstly a machine learning algorithm is trained using data from a queuing model (simulation module). The learnheuristic then constructs solutions using the machine learning algorithm to rapidly evaluate decisions in terms of facility completion and population waiting times. The efficiency and quality of the algorithm is demonstrated by comparison with exact and simulation-only (simheuristic) methodologies. A series of experiments are performed which explore the trade offs between solution cost, completion time, population travel and waiting times.Peer ReviewedPostprint (author's final draft

Assessment in Bologna context from the teaching perspective, similarities and differences between disciplines

In higher education, assessment is especially significant due to the high level of autonomy and self-regulation that is assumed in the students at this stage. While there is a bulk of research on which assessment evidences are used in higher education, research on how university professors design these evidences is lacking. Using a mixed method technique, we analyzed the assessment methodologies used in three different degrees (Mathematics, Medicine and Sport Sciences), and the design process followed by the teachers in each degree. We found important differences in the assessment methodologies used and the approaches to the assessment design in the degrees. This study shows the way in which teachers of different degrees modified their assessment methods during the Bologna process, as well as the factors that influenced them throughout the process

A simheuristic algorithm for solving an integrated resource allocation and scheduling problem

Modern companies have to face challenging configuration issues in their manufacturing chains. One of these challenges is related to the integrated allocation and scheduling of resources such as machines, workers, energy, etc. These integrated optimization problems are difficult to solve, but they can be even more challenging when real-life uncertainty is considered. In this paper, we study an integrated allocation and scheduling optimization problem with stochastic processing times. A simheuristic algorithm is proposed in order to effectively solve this integrated and stochastic problem. Our approach relies on the hybridization of simulation with a metaheuristic to deal with the stochastic version of the allocation-scheduling problem. A series of numerical experiments contribute to illustrate the efficiency of our methodology as well as their potential applications in real-life enterprise settings

Paisaje y turismo. El corredor bético de Alcaraz (Albacete)

It is our intention to raise some considerations concerning the function played by cultural tourism and the emerging role of landscape as a resource. A relevant case of this process in Castilla-La Mancha is the territory organized by the Guadalmena River, in the province of Albacete, and its immediate surroundings. The most relevant aspect of this valley is its relief, which creates its characteristic sharp lines. This relief contains several landscape units. The biogeographic characters of this climatologic crossroad result in a new singular element in the territory. Today, an interesting landscape tourist route, which starts at the historic town of Alcaraz, can be created by implementing the inventory of natural and cultural resources in the Valley of Gualdamena River.Se plantea una reflexión introductoria acerca de la función del turismo cultural y del papel emergente del paisaje como recurso territorial. En Castilla-La Mancha un caso relevante de este proceso lo constituye el territorio que ocupa el valle del río Guadalmena, en la provincia de Albacete, y su entorno inmediato. El elemento más destacado y por el que el valle adquiere sus caracteres mejor definidos es el relieve, que comprende varias unidades de paisaje. Los caracteres biogeográficos propios de una encrucijada climatológica añaden un nuevo elemento de singularidad a este territorio. La integración de los recursos naturales y culturales del valle del río Guadalmena facilita el desarrollo de una interesante ruta turística paisajística que tiene a la histórica ciudad de Alcaraz como punto de partida

Current Trends in Simheuristics: from smart transportation to agent-based simheuristics

Simheuristics extend metaheuristics by adding a simulation layer that allows the optimization component to deal efficiently with scenarios under uncertainty. This presentation reviews both initial as well as recent applications of simheuristics, mainly in the area of logistics and transportation. We also discuss a novel agent-based simheuristic (ABSH) approach that combines simheuristic and multi-agent systems to efficiently solve stochastic combinatorial optimization problems. The presentation is based on papers [1], [2], and [3], which have been already accepted in the prestigious Winter Simulation Conference.Peer ReviewedPostprint (published version

A variable neighborhood search simheuristic for project portfolio selection under uncertainty

With limited nancial resources, decision-makers in rms and governments face the task of selecting the best portfolio of projects to invest in. As the pool of project proposals increases and more realistic constraints are considered, the problem becomes NP-hard. Thus, metaheuristics have been employed for solving large instances of the project portfolio selection problem (PPSP). However, most of the existing works do not account for uncertainty. This paper contributes to close this gap by analyzing a stochastic version of the PPSP: the goal is to maximize the expected net present value of the inversion, while considering random cash ows and discount rates in future periods, as well as a rich set of constraints including the maximum risk allowed. To solve this stochastic PPSP, a simulation-optimization algorithm is introduced. Our approach integrates a variable neighborhood search metaheuristic with Monte Carlo simulation. A series of computational experiments contribute to validate our approach and illustrate how the solutions vary as the level of uncertainty increases

The non-smooth and bi-objective team orienteering problem with soft constraints

In the classical team orienteering problem (TOP), a fixed fleet of vehicles is employed, each of them with a limited driving range. The manager has to decide about the subset of customers to visit, as well as the visiting order (routes). Each customer offers a different reward, which is gathered the first time that it is visited. The goal is then to maximize the total reward collected without exceeding the driving range constraint. This paper analyzes a more realistic version of the TOP in which the driving range limitation is considered as a soft constraint: every time that this range is exceeded, a penalty cost is triggered. This cost is modeled as a piece-wise function, which depends on factors such as the distance of the vehicle to the destination depot. As a result, the traditional reward-maximization objective becomes a non-smooth function. In addition, a second objective, regarding the design of balanced routing plans, is considered as well. A mathematical model for this non-smooth and bi-objective TOP is provided, and a biased-randomized algorithm is proposed as a solving approach. © 2020 by the authors.This work has been partially supported by the Spanish Ministry of Economy and Competitiveness & FEDER (SEV-2015-0563), the Spanish Ministry of Science (PID2019-111100RB-C21, RED2018-102642-T), and the Erasmus+ Program (2019-I-ES01-KA103-062602)

Predicting the communication pattern evolution for scalability analysis

The performance of the message-passing applications on a parallel system can vary and cause ine ciencies as the applications grow. With the aim of providing scalability behavior information of these applications on a speci c system, we propose a methodology that allows to analyze and predict the application behavior in a bounded time and using a limited number of resources. The proposed methodology is based on the fact that most scienti c applications have been developed using speci c communicational and computational patterns, which have certain behavior rules. As the number of application processes increases, these patterns change their behavior following speci c rules, being functionally constants. Our methodology is focused on characterizing these patterns to nd its general behavior rules, in order to build a logical application trace to predict its performance. The methodology uses the PAS2P tool to obtain the application behavior information, that allow us to analyze quickly a set of relevant phases covering approximately 95% of the total application. In this paper, we present the entire methodology while the experimental validation, that has been validated for the NAS benchmarks, is focused on characterizing the communication pattern for each phase and to model its general behavior rules to predict the pattern as the number of processes increases.WPDP- XIII Workshop procesamiento distribuido y paraleloRed de Universidades con Carreras en Informática (RedUNCI

Predicting the communication pattern evolution for scalability analysis

The performance of the message-passing applications on a parallel system can vary and cause ine ciencies as the applications grow. With the aim of providing scalability behavior information of these applications on a speci c system, we propose a methodology that allows to analyze and predict the application behavior in a bounded time and using a limited number of resources. The proposed methodology is based on the fact that most scienti c applications have been developed using speci c communicational and computational patterns, which have certain behavior rules. As the number of application processes increases, these patterns change their behavior following speci c rules, being functionally constants. Our methodology is focused on characterizing these patterns to nd its general behavior rules, in order to build a logical application trace to predict its performance. The methodology uses the PAS2P tool to obtain the application behavior information, that allow us to analyze quickly a set of relevant phases covering approximately 95% of the total application. In this paper, we present the entire methodology while the experimental validation, that has been validated for the NAS benchmarks, is focused on characterizing the communication pattern for each phase and to model its general behavior rules to predict the pattern as the number of processes increases.WPDP- XIII Workshop procesamiento distribuido y paraleloRed de Universidades con Carreras en Informática (RedUNCI

Diagnosis of Rotor Asymmetries Faults in Induction Machines Using the Rectified Stator Current

(c) 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.[EN] Fault diagnosis of induction motors through the analysis of the stator current is increasingly being used in maintenance systems, because it is non-invasive and has low requirements of hardware and software. Nevertheless, its industrial application faces some practical limitations. In particular, the detection of fault harmonics that are very close to the fundamental component is challenging, as in large induction motors working at very low slip, because the leakage of the fundamental can hide the fault components until the damage is severe. Several methods have been proposed to alleviate this problem, although all of them increase noticeably the complexity of the diagnostic system. In this paper, a novel method is proposed, based on the analysis of the rectified motor current. It is shown that its spectrum contains the same fault harmonics as the spectrum of the original current signal, but with a much lower frequency, and free from the fundamental component leakage. Besides, the proposed method is very easy to implement, either by software, using the absolute value of the current samples, or by hardware, using a simple rectifier. The proposed approach is presented theoretically and validated experimentally with the detection of a broken bars fault of a large induction motor.This work was supported in part by the Spanish "Ministerio de Ciencia, Innovacion yUniversidades (MCIU)," in part by the "Agencia Estatal de Investigacion (AEI)," and in part by the "Fondo Europeo de Desarrollo Regional (FEDER)" in the framework of the "Proyectos I+D+i -Retos Investigacion 2018," under Project RTI2018-102175-B-I00 (MCIU/AEI/FEDER, UE).Puche-Panadero, R.; Martinez-Roman, J.; Sapena-Bano, A.; Burriel-Valencia, J. (2020). Diagnosis of Rotor Asymmetries Faults in Induction Machines Using the Rectified Stator Current. IEEE Transactions on Energy Conversion. 35(1):213-221. https://doi.org/10.1109/TEC.2019.2951008S21322135